Testing Boolean Function Isomorphism
نویسندگان
چکیده
Two boolean functions f, g : {0, 1} → {0, 1} are isomorphic if they are identical up to relabeling of the input variables. We consider the problem of testing whether two functions are isomorphic or far from being isomorphic with as few queries as possible. In the setting where one of the functions is known in advance, we show that the non-adaptive query complexity of the isomorphism testing problem is Θ̃(n). In fact, we show that the lower bound of Ω(n) queries for testing isomorphism to g holds for almost all functions g. In the setting where both functions are unknown to the testing algorithm, we show that the query complexity of the isomorphism testing problem is Θ̃(2). The bound in this result holds for both adaptive and nonadaptive testing algorithms.
منابع مشابه
Tight Lower Bounds for Testing Linear Isomorphism
We study lower bounds for testing membership in families of linear/affine-invariant Boolean functions over the hypercube. A family of functions P ⊆ {{0, 1} → {0, 1}} is linear/affine invariant if for any f ∈ P , it is the case that f ◦L ∈ P for any linear/affine transformation L of the domain. Motivated by the recent resurgence of attention to the permutation isomorphism problem, we first focus...
متن کاملOn testing bent functions
A bent function is a Boolean function all of whose Fourier coefficients are equal in absolute value. These functions have been extensively studied in cryptography and play an important role in cryptanalysis and design of cryptographic systems. We study bent functions in the framework of property testing. In particular, we show that testing whether a given Boolean function on n variables is bent...
متن کاملIsomorphism testing of read-once functions and polynomials
In this paper, we study the isomorphism testing problem of formulas in the Boolean and arithmetic settings. We show that isomorphism testing of Boolean formulas in which a variable is read at most once (known as read-once formulas) is complete for log-space. In contrast, we observe that the problem becomes polynomial time equivalent to the graph isomorphism problem, when the input formulas can ...
متن کاملIsomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits
Given two n-variable boolean functions f and g, we study the problem of computing an ε-approximate isomorphism between them. I.e. a permutation π of the n variables such that f(x1, x2, . . . , xn) and g(xπ(1), xπ(2), . . . , xπ(n)) differ on at most an ε fraction of all boolean inputs {0, 1}. We give a randomized 2 √ n polylog(n)) algorithm that computes a 1 2polylog(n) -approximate isomorphism...
متن کاملSequential measurements, disturbance and property testing
We describe two procedures which, given access to one copy of a quantum state and a sequence of two-outcome measurements, can distinguish between the case that at least one of the measurements accepts the state with high probability, and the case that all of the measurements have low probability of acceptance. The measurements cannot simply be tried in sequence, because early measurements may d...
متن کامل